Mining Sectorial Episodes from Event Sequences
نویسندگان
چکیده
In this paper, we introduce a sectorial episode of the form C → r, where C is a set of events and r is an event. The sectorial episode C → r means that every event of C is followed by an event r. Then, by formulating the support and the confidence of sectorial episodes, in this paper, we design the algorithm Sect to extract all of the sectorial episodes that are frequent and confidential from a given event sequence by traversing it just once. Finally, by applying the algorithm Sect to bacterial culture data, we extract sectorial episodes representing drug-
منابع مشابه
Mining Frequent Diamond Episodes from Event Sequences
In this paper, we introduce a diamond episode of the form s1 → E → s2, where s1 and s2 are events and E is a set of events. The diamond episode s1 → E → s2 means that every event of E follows an event s1 and is followed by an event s2. Then, by formulating the support of diamond episodes, in this paper, we design the algorithm FreqDmd to extract all of the frequent diamond episodes from a given...
متن کاملDiscovering Frequent Episodes in Sequences of Complex Events
Data collected in many applications have a form of sequences of events. One of the popular data mining problems is discovery of frequently occurring episodes in such sequences. Efficient algorithms discovering all frequent episodes have been proposed for sequences of simple events associated with basic event types. But in many cases events are described by a set of attributes rather than by jus...
متن کاملStreaming Algorithms for Pattern Discovery over Dynamically Changing Event Sequences
Discovering frequent episodes over event sequences is an important data mining task. In many applications, events constituting the data sequence arrive as a stream, at furious rates, and recent trends (or frequent episodes) can change and drift due to the dynamical nature of the underlying event generation process. The ability to detect and track such the changing sets of frequent episodes can ...
متن کاملMining Frequent Elliptic Episodes from Event Sequences
In this paper, we formulate an episode in episode mining as an acyclic transitive labeled digraph. Also we introduce an elliptic episode s → [S1, . . . , Sn] → t such that s and t are event types, [S1, . . . , Sn] is a sequence of serial episodes, and every pair of Si and Sj shares no same event type. Then, we show that every elliptic episode is constructible from serial episodes. Next, in this...
متن کاملMining Closed Episodes from Event Sequences Efficiently
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the properties of minimal occurrences and design effective pruning techniques to prune non-closed episodes. An efficient mining algorithm Clo_episode is proposed to mine all closed episodes following a breadth-first sear...
متن کامل